A Hardware Architecture for a Parallel Genetic Algorithm for Image Registration
نویسندگان
چکیده
Introduction Parallel Genetic Algorithms (PGAs) have frequently been cited as an important area of research as they provide a means of rapidly developing a solution to a wide range of problems. Real-time image analysis is one of the areas of research which would particularly benefit from PGAs, however such algorithms are generally simulated on conventional computers or are designed for expensive hardware systems. For practical image processing on a large scale, cheap, fast and efficient PGA processors are required as part of a vision system. Vision systems require processing techniques which are robust, fast and capable of dealing with large quantities of data. Genetic algorithms have been used because of the first of these criteria, as is exemplified in the works of Fitzpatrick 1984, Mandava 1989, McAulay 1989. However by using hardware parallel genetic algorithms the second and third criteria could also be fulfilled. Fitzpatrick suggests that a parallel implementation would be beneficial and various forms of Parallel Genetic Algorithm (PGA) have been suggested by other authors. Many of the different techniques are covered in the five international conference proceedings on genetic algorithms and the first Workshop on Parallel Problem Solving from Nature. In this paper the nature of Parallel Genetic Algorithms is described followed by the application of genetic algorithms to vision systems. A description of a hardware architecture for vision systems is detailed along with various modifications to improve the implementation. A simulation is used to produce results that verify the effectiveness of the hardware architecture and finally conclusions and future work are discussed.
منابع مشابه
A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملEfficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems
Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...
متن کاملLossless Microarray Image Compression by Hardware Array Compactor
Microarray technology is a new and powerful tool for concurrent monitoring of large number of genes expressions. Each microarray experiment produces hundreds of images. Each digital image requires a large storage space. Hence, real-time processing of these images and transmission of them necessitates efficient and custom-made lossless compression schemes. In this paper, we offer a new archi...
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملA Parallel Genetic VLSI Architecture for Combinatorial Real-Time Applications - Disc Scheduling
Introduction Parallel Genetic Algorithms (PGAs) have frequently been cited as an important area of research as they provide a means of rapidly developing a solution to a wide range of problems. In particular the Parallel Genetic Algorithm has the potential for solving problems far faster than a conventional Genetic Algorithm(GA). Despite these advantages real-time applications are rarely discus...
متن کامل